Limits on agenda control in spatial voting games
نویسندگان
چکیده
منابع مشابه
Limits on Agenda Control in Spatial Voting Games? Scott
A theorem due to McKelvey implies that, if a single agent controls the agenda of a spatial voting game, he can almost always design an agenda that yields whatever voting outcome he wishes. Here we make use of a geometrical construct called the “yolk” to demonstrate the existence of significant limits on such agenda control. We show that the feasibility of agenda control is inversely related to ...
متن کاملStructural Control in Weighted Voting Games
Inspired by the study of control scenarios in elections and complementing manipulation and bribery settings in cooperative games with transferable utility, we introduce the notion of structural control in weighted voting games. We model two types of influence, adding players to and deleting players from a game, with goals such as increasing a given player’s Shapley–Shubik or probabilistic Penro...
متن کامل: Voting the Agenda
University Press. All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher, except for reading and browsing via the World Wide Web. Users are not permitted to mount this file on any network servers.
متن کاملRecognizing Majority-Rule Equilibrium In Spatial Voting Games
It is provably difficult (NP-complete) to determine whether a given point can be defeated in a majority-rule spatial voting game. Nevertheless, one can easily generate a point with the property that if any point cannot be defeated, then this point cannot be defeated. Our results suggest that majority-rule equilibrium can exist as a purely practical matter: when the number of voters and the dime...
متن کاملParliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty
We study computational problems for two popular parliamentary voting procedures: the amendment procedure and the successive procedure. While finding successful manipulations or agenda controls is tractable for both procedures, our real-world experimental results indicate that most elections cannot be manipulated by a few voters and agenda control is typically impossible. If the voter preference...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1989
ISSN: 0895-7177
DOI: 10.1016/0895-7177(89)90413-5